Parallel SAT-Based Parameterised Three-Valued Model Checking

Parameterisation in three-valued model checking (PMC) allows to establish logical connections between unknown parts in state space models. The application of parameterisation enhances the precision of models without increasing their state space, but it leads to an exponential growth of the number of model checking instances that have to be checked consecutively. Here, we introduce a technique for PMC via parallel SAT solving which enables us to significantly reduce the time overhead of PMC by exploiting similarities among the instances. We define bounded semantics and a propositional logic encoding of PMC. Moreover, we introduce a concept for sharing clauses between the instances of parallel SAT-based PMC. Our experiments show that our new approach leads to a practically relevant speed-up of parameterised three-valued model checking.